New Bounds for Restricted Isometry Constants in Low-rank Matrix Recovery

نویسندگان

  • Lingchen Kong
  • Naihua Xiu
چکیده

In this paper, we establish new bounds for restricted isometry constants (RIC) in low-rank matrix recovery. Let A be a linear transformation from Rm×n into Rp, and r the rank of recovered matrix X ∈ Rm×n. Our main result is that if the condition on RIC satisfies δ2r+k + 2( r k ) δmax{r+ 3 2 k,2k} < 1 for a given positive integer k ≤ m − r, then r-rank matrix can be exactly recovered via nuclear norm minimization problem in noiseless case, and estimated stably in the noise case. Taking different k, we obtain some improved and new RIC bounds such as δ 7 3 r + 2 √ 3δ1.5r < 1, δ2.5r + 2 √ 2δ1.75r < 1, δ2r+1 + 2 √ rδr+2 < 1, δ2r+2 + √ 2rδr+3 < 1, or δ2r+4+ √ rδr+7 < 1. To the best of our knowledge, these are the first such conditions on RIC.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements

This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entries. We show that properly constrained nuclear-normminimization stably recovers a low-rank matrix from a constant number of noisy measurements per degree of freedom; this seems to be the first result of this nature. Fu...

متن کامل

Low rank tensor recovery via iterative hard thresholding

We study extensions of compressive sensing and low rank matrix recovery (matrix completion) to the recovery of low rank tensors of higher order from a small number of linear measurements. While the theoretical understanding of low rank matrix recovery is already well-developed, only few contributions on the low rank tensor recovery problem are available so far. In this paper, we introduce versi...

متن کامل

Exact Low-rank Matrix Recovery via Nonconvex Mp-Minimization

The low-rank matrix recovery (LMR) arises in many fields such as signal and image processing, statistics, computer vision, system identification and control, and it is NP-hard. It is known that under some restricted isometry property (RIP) conditions we can obtain the exact low-rank matrix solution by solving its convex relaxation, the nuclear norm minimization. In this paper, we consider the n...

متن کامل

Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices

Restricted Isometry Constants (RICs) provide a measure of how far from an isometry a matrix can be when acting on sparse vectors. This, and related quantities, provide a mechanism by which standard eigen-analysis can be applied to topics relying on sparsity. RIC bounds have been presented for a variety of random matrices and matrix dimension and sparsity ranges. We provide explicitly formulae f...

متن کامل

Sparse Recovery Algorithms: Sufficient Conditions in terms of Restricted Isometry Constants

We review three recovery algorithms used in Compressive Sensing for the reconstruction s-sparse vectors x ∈ CN from the mere knowledge of linear measurements y = Ax ∈ Cm, m < N. For each of the algorithms, we derive improved conditions on the restricted isometry constants of the measurement matrix A that guarantee the success of the reconstruction. These conditions are δ2s < 0.4652 for basis pu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011